#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <cmath>
#include <cstring>
#include <string>
#include <iomanip>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#define int long long
#define x first 
#define y second  
using namespace std;
const int N = 2e6 + 10;
int arr[N];
void solve()
{
     int n,m,k;
     cin >> n >> m >> k;
     for(int i = 1; i <= n; i++)
     {
        cin >> arr[i];
     }
     sort(arr + 1 , arr + n + 1);
     int ans = 0;
     int sum = 0;
     for(int i = 1; i <= k; i++)
     {
          sum += arr[i];
     }
    ans += ceil(sum * 1.0 / m * 1.0);
     cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t = 1;
    while(t -- )  solve();
    return 0;
}